package LeetCode刷题;

/**
 * @program: Java_Study
 * @author: Xiaofan
 * @createTime: 2021-10-16 15:52
 * @description: Functions of this class is
 **/
public class NoNo相交链表 {
    public static void main(String args[]){

    }
    /**
     * 官方题解：
     * public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
     *         if(headB==null||headA==null){
     *             return null;
     *         }
     *         ListNode p1=headA;
     *         ListNode p2=headB;
     *         while(p1!=p2){
     *             p1=(p1==null)?headB:p1.next;
     *             p2=(p2==null)?headA:p2.next;
     *         }
     *         return p1;
     *     }
     */

}